منابع مشابه
Translational polygon containment
In this paper we present a natural and simple procedure to compute all feasible allocation points of a (non-convex) polygon within a (non-convex) polygonal bounded region. This procedure can be seen as a basis of more sophisticated and efficient algorithms for the same task, or for related problems such as finding a single placement point.
متن کاملA Solution of Polygon Containment, Spatial Planning, and Other Related Problems Using Minkowski Operations
This paper gives a complete solution to the polygon containment problem under translation and other related problems for all kinds of two dimensional regions. The solution is achieved in three steps. First, it is shown that the containment and the related problems can be directly mapped to Minkowski decomposition and addition problems. Minkowski decomposition, which is intrinsically a geometric...
متن کاملFinding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
Given a simple polygon P , we consider the problem of finding a convex polygon Q contained in P that minimizes H(P, Q), where H denotes the Hausdorff distance. We call such a polygon Q a Hausdorff core of P . We describe polynomial-time approximations for both the minimization and decision versions of the Hausdorff core problem, and we provide an argument supporting the hardness of the problem.
متن کاملTranslational Polygon Containment and Minimal Enclosure Using Mathematical Programming
We present a new algorithm for the two-dimensional translational containment problem: nd translations for k polygons which place them inside a polygonal container without overlapping. Both the polygons and the container can be nonconvex. The algorithm is based on mathematical programming principles. We generalize our containment approach to solve minimal enclosure problems. We give algorithms t...
متن کاملPolygon-Constrained Motion Planning Problems
We consider the following class of polygon-constrained motion planning problems: Given a set of k centrally controlled mobile agents (say pebbles) initially sitting on the vertices of an n-vertex simple polygon P , we study how to plan their vertex-to-vertex motion in order to reach with a minimum (either maximum or total) movement (either in terms of number of hops or Euclidean distance) a fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1994
ISSN: 0925-7721
DOI: 10.1016/0925-7721(94)90011-6